Factorization of polynomials over a finite field and irreducibility tests - PDFSEARCH.IO - Document Search Engine

Factorization of polynomials over a finite field and irreducibility tests
Results: 117

#	Item
61	SERMON (South East Regional Meeting On Numbers) April[removed], 1999 University of South Carolina Columbia, South Carolina, United States Add to Reading List Source URL: www.math.sc.edu Language: English - Date: 1999-10-20 12:14:43 Analytic number theory Integer sequences Prime number Elliptic curve Bernoulli number Bateman–Horn conjecture Factorization of polynomials over a finite field and irreducibility tests Mathematics Number theory Abstract algebra
62	Course Description for Spring 2003 Course Title: Math 788G: The Theory of Irreducible Polynomials II Instructor: Michael Filaseta Prerequisites: Graduate Standing (no prior Number Theory course is necessary; background m Add to Reading List Source URL: www.math.sc.edu Language: English - Date: 2002-08-28 10:37:15 Computer algebra Abstract algebra Irreducible polynomial Finite fields Factorization of polynomials over a finite field and irreducibility tests Factorization of polynomials Mathematics Polynomials Algebra
63	Divisibility properties of generalized Laguerre polynomials Add to Reading List Source URL: www.math.tifr.res.in Language: English - Date: 2010-07-28 06:32:06 Polynomials Laguerre polynomials Binomial coefficient Factorization of polynomials over a finite field and irreducibility tests Mathematics Abstract algebra Algebra
64	Generalizations of some irreducibility results by Schur T.N. Shorey and R. Tijdeman October 16, 2009 Section 1. Introduction Let a ≥ 0 and a0 , a1 , . . . , an be integers with Add to Reading List Source URL: www.math.tifr.res.in Language: English - Date: 2009-10-22 08:03:09 Polynomials Algebra Inverse Galois problem Laguerre polynomials Irreducible polynomial Binomial coefficient Factorization of polynomials over a finite field and irreducibility tests Mathematics Mathematical analysis Abstract algebra
65 $Polynomials / Field extension / Root of unity / Minimal polynomial / Factorization of polynomials over a finite field and irreducibility tests / Partial fraction / Abstract algebra / Algebra / Mathematics$	An Introduction to Galois Theory Solutions to the exercises[removed]Chapter[removed]Clearly {n ∈ Z : n > 0 and nr = 0 for all r ∈ R} ⊆ {n ∈ Z : n > 0 and n1 = 0}. If 0 < n ∈ Z and Add to Reading List Source URL: www.maths.gla.ac.uk Language: English - Date: 2012-12-16 10:36:21 Polynomials Field extension Root of unity Minimal polynomial Factorization of polynomials over a finite field and irreducibility tests Partial fraction Abstract algebra Algebra Mathematics
66 $Polynomials / Coding theory / Field theory / Finite fields / Factorization of polynomials over a finite field and irreducibility tests / Partial fraction / Abstract algebra / Mathematics / Algebra$	A-138 A.2 Polynomial Algebra over Fields Add to Reading List Source URL: www.mth.msu.edu Language: English - Date: 2012-08-31 11:04:32 Polynomials Coding theory Field theory Finite fields Factorization of polynomials over a finite field and irreducibility tests Partial fraction Abstract algebra Mathematics Algebra
67	Weil Image Sums (and some related problems) September ,  ver. . Add to Reading List Source URL: www.untruth.org Language: English - Date: 2012-02-29 00:47:43 Dickson polynomial Algebraic geometry Factorization of polynomials over a finite field and irreducibility tests Arithmetic circuit complexity Polynomials Mathematics Algebra
68	Last modified: March 20, 2005. MY MAIN WORK ON THE THREE TOPICS Zhi-Wei Sun Department of Mathematics Nanjing University Add to Reading List Source URL: math.nju.edu.cn Language: English - Date: 2014-06-05 01:00:41 Integer sequences Number theory Factorial Ring Binomial coefficient Factorization of polynomials over a finite field and irreducibility tests Mathematics Mathematical analysis Combinatorics
69	From coding theory to efficient pattern matching Rapha¨el Clifford University of Bristol, Dept. of Computer Science Bristol, BS8 1UB, UK [removed] Klim Efremenko Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:17 Analysis of algorithms Probabilistic complexity theory Time complexity Matching Factorial Approximate string matching Randomized algorithm Big O notation Factorization of polynomials over a finite field and irreducibility tests Theoretical computer science Mathematics Computational complexity theory
70	THE RAMANUJAN JOURNAL 1, 227–[removed]c 1997 Kluwer Academic Publishers. Manufactured in The Netherlands. ° On Locally Repeated Values of Certain Arithmetic Functions, IV Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2005-03-02 15:21:07 Prime number theorem Diophantine approximation Complex analysis Mathematical series Real analysis Factorization of polynomials over a finite field and irreducibility tests Auxiliary function Mathematical analysis Mathematics Arithmetic function

UPDATE